ANN-Assisted CoSaMP Algorithm for Linear Electromagnetic Imaging of Spatially Sparse Domains

نویسندگان

چکیده

Greedy pursuit algorithms (GPAs) are widely used to reconstruct sparse signals. Even though many electromagnetic (EM) inverse scattering problems solved on investigation domains, GPAs have rarely been for this purpose. This is because (i) they require a priori knowledge of the sparsity level in domain, which often not available EM imaging applications, and (ii) matrix does satisfy restricted isometric property. In work, these challenges respectively addressed by using an artificial neural network (ANN) estimate level, adding Tikhonov regularization term diagonal elements matrix. These enhancements permit compressive sampling matching (CoSaMP) algorithm be efficiently solve two-dimensional problem, linearized Born approximation, spatially domains. Numerical results, demonstrate efficiency applicability proposed ANN-enhanced CoSaMP algorithm, provided.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stochastic CoSaMP: Randomizing Greedy Pursuit for Sparse Signal Recovery

In this paper, we formulate the K-sparse compressed signal recovery problem with the L0 norm within a Stochastic Local Search (SLS) framework. Using this randomized framework, we generalize the popular sparse recovery algorithm CoSaMP, creating Stochastic CoSaMP (StoCoSaMP). Interestingly, our deterministic worst case analysis shows that under the Restricted Isometric Property (RIP), even a pur...

متن کامل

Linear-Time Algorithm for Learning Large-Scale Sparse Graphical Models

The sparse inverse covariance estimation problem is commonly solved using an l1-regularizedGaussian maximum likelihood estimator known as “graphical lasso”, but its computational cost becomes prohibitive for large data sets. A recent line of results showed–under mild assumptions–that the graphical lasso estimator can be retrieved by soft-thresholding the sample covariance matrix and solving a m...

متن کامل

Modified Bayesian Optimization Algorithm for Sparse Linear Antenna Design

In this paper, a modified Bayesian Optimization Algorithm (BOA), named M-BOA, is proposed to introduce a suitable mutation scheme for the traditional procedure in order to speed up the convergence of the algorithm and to avoid it to be trapped in local minima or to stagnate in suboptimal solutions. The proposed algorithm has been applied both to a specific mathematical test function and to spar...

متن کامل

Sparse spectral deconvolution algorithm for noncartesian MR spectroscopic imaging.

PURPOSE To minimize line shape distortions and spectral leakage artifacts in MR spectroscopic imaging (MRSI). METHODS A spatially and spectrally regularized non-Cartesian MRSI algorithm that uses the line shape distortion priors, estimated from water reference data, to deconvolve the spectra is introduced. Sparse spectral regularization is used to minimize noise amplification associated with ...

متن کامل

Spatially-sparse convolutional neural networks

Convolutional neural networks (CNNs) perform well on problems such as handwriting recognition and image classification. However, the performance of the networks is often limited by budget and time constraints, particularly when trying to train deep networks. Motivated by the problem of online handwriting recognition, we developed a CNN for processing spatially-sparse inputs; a character drawn w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Antennas and Propagation

سال: 2021

ISSN: ['1558-2221', '0018-926X']

DOI: https://doi.org/10.1109/tap.2021.3060547